The Minimum Number of Edge-Directions of a Convex Polytope
نویسندگان
چکیده
We show that the minimum number of distinct edge-directions of a convex polytope with n vertices in Rd is θ(dn1/(d−1)).
منابع مشابه
A note on the minimum number of edge-directions of a convex polytope
We show that the minimum number of distinct edge-directions of a convex polytope with n vertices in R is yðdn1=ðd 1ÞÞ: r 2004 Published by Elsevier Inc.
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملEnergy of Convex Sets, Shortest Paths, and Resistance
Let us assign independent, exponentially distributed random edge lengths to the edges of an undirected graph. Lyons, Pemantle and Peres [11] proved that the expected length of the shortest path between two given nodes is bounded from below by the resistance between these nodes, where the resistance of an edge is the expectation of its length. They remarked that instead of exponentially distribu...
متن کاملEfficient edge-skeleton computation for polytopes defined by oracles
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify problems (and polytope representations) for which total polynomial-time algorithms can be obtained. We offer the first total polynomial-time algorithm for computing...
متن کاملThe convex domination subdivision number of a graph
Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is adominating set of $G$ if every vertex in $Vsetminus D$ has atleast one neighbor in $D$. The distance $d_G(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$G$. An $(u,v)$-path of length $d_G(u,v)$ is called an$(u,v)$-geodesic. A set $Xsubseteq V$ is convex in $G$ ifvertices from all $(a, b)$-geodesics belon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009